#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char s[maxn],p[maxn];
vector<LL>pos[30];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
        cin>>(s);LL n=strlen(s);
        cin>>(p);LL m=strlen(p);
        LL j=m-1;
        for(LL i=n-1;i>=0;i--){
            if(s[i]!=p[j]) i--;
            else j--;
            if(j==-1) break;
        }
        if(j==-1) cout<<"YES"<<"\n";
        else cout<<"NO"<<"\n";
    }
   	return 0;
}
